#include<bits/stdc++.h>
using namespace std;

class Solution {
public:
    bool findSubarrays(vector<int>& nums) {
        int n = nums.size();
        if (n < 3) return false;
        unordered_set<int> st;
        for (int i = 1; i < n; i++) {
            if (st.count(nums[i] + nums[i - 1])) {
                return true;
            } else {
                st.emplace(nums[i] + nums[i - 1]);
            }
        }
        return false;
    }
};

/**
 * @date 2022-09-03
 * @brief 模拟没啥好说的
 */